Left Termination proof of /tmp/tmped1N0a/ackermann.pl

Left Termination of the query pattern ackermann_in_3(g, g, a) w.r.t. the given Prolog program could successfully be proven:

↳ Prolog

  ↳ PrologToPiTRSProof

Clauses:

ackermann(0, N, s(N)).
ackermann(s(M), 0, Val) :- ackermann(M, s(0), Val).
ackermann(s(M), s(N), Val) :- ','(ackermann(s(M), N, Val1), ackermann(M, Val1, Val)).

Queries:

ackermann(g,g,a).

We use the technique of [30].Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

ackermann_in(s(M), s(N), Val) → U2(M, N, Val, ackermann_in(s(M), N, Val1))
ackermann_in(s(M), 0, Val) → U1(M, Val, ackermann_in(M, s(0), Val))
ackermann_in(0, N, s(N)) → ackermann_out(0, N, s(N))
U1(M, Val, ackermann_out(M, s(0), Val)) → ackermann_out(s(M), 0, Val)
U2(M, N, Val, ackermann_out(s(M), N, Val1)) → U3(M, N, Val, ackermann_in(M, Val1, Val))
U3(M, N, Val, ackermann_out(M, Val1, Val)) → ackermann_out(s(M), s(N), Val)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

ackermann_in(s(M), s(N), Val) → U2(M, N, Val, ackermann_in(s(M), N, Val1))
ackermann_in(s(M), 0, Val) → U1(M, Val, ackermann_in(M, s(0), Val))
ackermann_in(0, N, s(N)) → ackermann_out(0, N, s(N))
U1(M, Val, ackermann_out(M, s(0), Val)) → ackermann_out(s(M), 0, Val)
U2(M, N, Val, ackermann_out(s(M), N, Val1)) → U3(M, N, Val, ackermann_in(M, Val1, Val))
U3(M, N, Val, ackermann_out(M, Val1, Val)) → ackermann_out(s(M), s(N), Val)

The argument filtering Pi contains the following mapping:
ackermann_in(x1, x2, x3) = ackermann_in(x1, x2)
s(x1) = s(x1)
U2(x1, x2, x3, x4) = U2(x1, x4)
0 = 0
U1(x1, x2, x3) = U1(x3)
ackermann_out(x1, x2, x3) = ackermann_out(x3)
U3(x1, x2, x3, x4) = U3(x4)

Using Dependency Pairs [1,30] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

ACKERMANN_IN(s(M), s(N), Val) → U2¹(M, N, Val, ackermann_in(s(M), N, Val1))
ACKERMANN_IN(s(M), s(N), Val) → ACKERMANN_IN(s(M), N, Val1)
ACKERMANN_IN(s(M), 0, Val) → U1¹(M, Val, ackermann_in(M, s(0), Val))
ACKERMANN_IN(s(M), 0, Val) → ACKERMANN_IN(M, s(0), Val)
U2¹(M, N, Val, ackermann_out(s(M), N, Val1)) → U3¹(M, N, Val, ackermann_in(M, Val1, Val))
U2¹(M, N, Val, ackermann_out(s(M), N, Val1)) → ACKERMANN_IN(M, Val1, Val)

The TRS R consists of the following rules:

ackermann_in(s(M), s(N), Val) → U2(M, N, Val, ackermann_in(s(M), N, Val1))
ackermann_in(s(M), 0, Val) → U1(M, Val, ackermann_in(M, s(0), Val))
ackermann_in(0, N, s(N)) → ackermann_out(0, N, s(N))
U1(M, Val, ackermann_out(M, s(0), Val)) → ackermann_out(s(M), 0, Val)
U2(M, N, Val, ackermann_out(s(M), N, Val1)) → U3(M, N, Val, ackermann_in(M, Val1, Val))
U3(M, N, Val, ackermann_out(M, Val1, Val)) → ackermann_out(s(M), s(N), Val)

The argument filtering Pi contains the following mapping:
ackermann_in(x1, x2, x3) = ackermann_in(x1, x2)
s(x1) = s(x1)
U2(x1, x2, x3, x4) = U2(x1, x4)
0 = 0
U1(x1, x2, x3) = U1(x3)
ackermann_out(x1, x2, x3) = ackermann_out(x3)
U3(x1, x2, x3, x4) = U3(x4)
U3¹(x1, x2, x3, x4) = U3¹(x4)
U2¹(x1, x2, x3, x4) = U2¹(x1, x4)
ACKERMANN_IN(x1, x2, x3) = ACKERMANN_IN(x1, x2)
U1¹(x1, x2, x3) = U1¹(x3)

We have to consider all (P,R,Pi)-chains

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

ACKERMANN_IN(s(M), s(N), Val) → U2¹(M, N, Val, ackermann_in(s(M), N, Val1))
ACKERMANN_IN(s(M), s(N), Val) → ACKERMANN_IN(s(M), N, Val1)
ACKERMANN_IN(s(M), 0, Val) → U1¹(M, Val, ackermann_in(M, s(0), Val))
ACKERMANN_IN(s(M), 0, Val) → ACKERMANN_IN(M, s(0), Val)
U2¹(M, N, Val, ackermann_out(s(M), N, Val1)) → U3¹(M, N, Val, ackermann_in(M, Val1, Val))
U2¹(M, N, Val, ackermann_out(s(M), N, Val1)) → ACKERMANN_IN(M, Val1, Val)

The TRS R consists of the following rules:

ackermann_in(s(M), s(N), Val) → U2(M, N, Val, ackermann_in(s(M), N, Val1))
ackermann_in(s(M), 0, Val) → U1(M, Val, ackermann_in(M, s(0), Val))
ackermann_in(0, N, s(N)) → ackermann_out(0, N, s(N))
U1(M, Val, ackermann_out(M, s(0), Val)) → ackermann_out(s(M), 0, Val)
U2(M, N, Val, ackermann_out(s(M), N, Val1)) → U3(M, N, Val, ackermann_in(M, Val1, Val))
U3(M, N, Val, ackermann_out(M, Val1, Val)) → ackermann_out(s(M), s(N), Val)

The argument filtering Pi contains the following mapping:
ackermann_in(x1, x2, x3) = ackermann_in(x1, x2)
s(x1) = s(x1)
U2(x1, x2, x3, x4) = U2(x1, x4)
0 = 0
U1(x1, x2, x3) = U1(x3)
ackermann_out(x1, x2, x3) = ackermann_out(x3)
U3(x1, x2, x3, x4) = U3(x4)
U3¹(x1, x2, x3, x4) = U3¹(x4)
U2¹(x1, x2, x3, x4) = U2¹(x1, x4)
ACKERMANN_IN(x1, x2, x3) = ACKERMANN_IN(x1, x2)
U1¹(x1, x2, x3) = U1¹(x3)

We have to consider all (P,R,Pi)-chains
The approximation of the Dependency Graph [30] contains 1 SCC with 2 less nodes.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ PiDP

              ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

ACKERMANN_IN(s(M), s(N), Val) → U2¹(M, N, Val, ackermann_in(s(M), N, Val1))
ACKERMANN_IN(s(M), s(N), Val) → ACKERMANN_IN(s(M), N, Val1)
U2¹(M, N, Val, ackermann_out(s(M), N, Val1)) → ACKERMANN_IN(M, Val1, Val)
ACKERMANN_IN(s(M), 0, Val) → ACKERMANN_IN(M, s(0), Val)

The TRS R consists of the following rules:

ackermann_in(s(M), s(N), Val) → U2(M, N, Val, ackermann_in(s(M), N, Val1))
ackermann_in(s(M), 0, Val) → U1(M, Val, ackermann_in(M, s(0), Val))
ackermann_in(0, N, s(N)) → ackermann_out(0, N, s(N))
U1(M, Val, ackermann_out(M, s(0), Val)) → ackermann_out(s(M), 0, Val)
U2(M, N, Val, ackermann_out(s(M), N, Val1)) → U3(M, N, Val, ackermann_in(M, Val1, Val))
U3(M, N, Val, ackermann_out(M, Val1, Val)) → ackermann_out(s(M), s(N), Val)

The argument filtering Pi contains the following mapping:
ackermann_in(x1, x2, x3) = ackermann_in(x1, x2)
s(x1) = s(x1)
U2(x1, x2, x3, x4) = U2(x1, x4)
0 = 0
U1(x1, x2, x3) = U1(x3)
ackermann_out(x1, x2, x3) = ackermann_out(x3)
U3(x1, x2, x3, x4) = U3(x4)
U2¹(x1, x2, x3, x4) = U2¹(x1, x4)
ACKERMANN_IN(x1, x2, x3) = ACKERMANN_IN(x1, x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ PiDP

              ↳ PiDPToQDPProof

                ↳ QDP

                  ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

ACKERMANN_IN(s(M), 0) → ACKERMANN_IN(M, s(0))
ACKERMANN_IN(s(M), s(N)) → ACKERMANN_IN(s(M), N)
U2¹(M, ackermann_out(Val1)) → ACKERMANN_IN(M, Val1)
ACKERMANN_IN(s(M), s(N)) → U2¹(M, ackermann_in(s(M), N))

The TRS R consists of the following rules:

ackermann_in(s(M), s(N)) → U2(M, ackermann_in(s(M), N))
ackermann_in(s(M), 0) → U1(ackermann_in(M, s(0)))
ackermann_in(0, N) → ackermann_out(s(N))
U1(ackermann_out(Val)) → ackermann_out(Val)
U2(M, ackermann_out(Val1)) → U3(ackermann_in(M, Val1))
U3(ackermann_out(Val)) → ackermann_out(Val)

The set Q consists of the following terms:

ackermann_in(x0, x1)
U1(x0)
U2(x0, x1)
U3(x0)

We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

U2¹(M, ackermann_out(Val1)) → ACKERMANN_IN(M, Val1)
The graph contains the following edges 1 >= 1, 2 > 2
ACKERMANN_IN(s(M), s(N)) → U2¹(M, ackermann_in(s(M), N))
The graph contains the following edges 1 > 1
ACKERMANN_IN(s(M), s(N)) → ACKERMANN_IN(s(M), N)
The graph contains the following edges 1 >= 1, 2 > 2
ACKERMANN_IN(s(M), 0) → ACKERMANN_IN(M, s(0))
The graph contains the following edges 1 > 1